/* 
 * File:   Edge.cpp
 * Author: reinhard
 * 
 * Created on 30. September 2011, 11:28
 */

#include "Graph.h"

Edge::Edge(Node* from, Node* to) {
    nodes = new std::pair<Node*,Node*>(from,to);
}

Edge::Edge(const Edge& orig) {
}

Edge::~Edge() {
}

bool Edge::isLoop(){
    return (nodes->first == nodes->second);
}
